On upper bound graphs whose complements are also upper bound graphs
نویسندگان
چکیده
منابع مشابه
On upper bound graphs whose complements are also upper bound graphs
In this paper, we consider upper bound graphs and double bound graphs of posets. We obtain a characterization of upper bound graphs whose complements are also upper bound graphs as follows: for a connected graph G, both G and G are upper bound graphs if and only if G is a split graph with V(G)= K + S, where K is a clique and S is an independent set, satisfying one of the following conditions: (...
متن کاملThe upper bound on k-tuple domination numbers of graphs
In a graph G, a vertex is said to dominate itself and all vertices adjacent to it. For a positive integer k, the k-tuple domination number γ×k(G) of G is the minimum size of a subset D of V (G) such that every vertex in G is dominated by at least k vertices in D. To generalize/improve known upper bounds for the k-tuple domination number, this paper establishes that for any positive integer k an...
متن کاملA New Upper Bound On Forwarding Index of Graphs
To measure the efficiency of a routing in network, Chung et al [The forwarding index of communication networks. IEEE Trans. Inform. Theory, 33 (2) (1987), 224-232] proposed the notion of forwarding index and established the tight upper bound (n − 1)(n − 2) for a connected graph of order n. This note improves this bound in terms of order n and maximum degree ∆ to the tight upper bound (n−1)(n−2)...
متن کاملNote on Construction Methods of Upper Bound Graphs
In this paper, we consider construction of upper bound graphs. An upper bound graph can be transformed into a nova by contractions and a nova can be transformed into an upper bound graph by splits. By these results, we get a characterization on upper bound graphs.
متن کاملA Tight Upper Bound on Acquaintance Time of Graphs
In this note we confirm a conjecture raised by Benjamini et al. [BST13] on the acquaintance time of graphs, proving that for all graphs G with n vertices it holds that AC(G) = O(n3/2), which is tight up to a multiplicative constant. This is done by proving that for all graphs G with n vertices and maximal degree ∆ it holds that AC(G) ≤ 20∆n. Combining this with the bound AC(G) ≤ O(n2/∆) from [B...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1998
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(97)00048-4